#include <stdio.h>
#include <memory.h>
#include "src/include/02_linear_list/SeqLIst.h"
#include "src/include/02_linear_list/LinkList.h"
#include "src/include/03StackQueue/stack.h"
#include "src/include/03StackQueue/queue.h"
#include "src/include/04String/myString.h"
#include "src/include/06tree/tree.h"
#include "src/include/07graph/graph.h"
#include "src/include/08search/BinarySortTree.h"
#include "src/include/08search/B-tree.h"
#include "src/include/08search/BTreePlus.h"
#include "src/include/08search/HashTable.h"
#include "src/include/09sort/losertree.h"
#include "src/include/09sort/files.h"
#include "src/include/09sort/merge_sort.h"
int main() {
    //biTree_main();
    //string_test();
    //HashTable_main();
    //mGraph_test();
    //AdjListGraph_test();
    //BiSearchTree_main();
    //BTree_Main();
    //BTreePlus_Main();
    //LoserTree_test();
    main_files_test ();
    loser_tree_main(50);
    return 0;
}